Application of Ant Colony Algorithm Constrained by Multiple QoS in Routing
نویسندگان
چکیده
منابع مشابه
QoS Multicast Routing Algorithm Based on Crowding Ant Colony Algorithm
The basic ant colony algorithm is easy to fall into local optimum and its convergent speed is slow for solving multiple QoS multicast routing problems. Therefore, a crowding ant colony algorithm is proposed in this paper to solve the problems. Crowded degree in artificial fish swarm algorithm is used to adjust nodes transition strategy dynamically according to the congestion of nodes. Stagnatio...
متن کاملAnt Colony Algorithm for the Single Loop Routing Problem
In this paper, a new algorithm for solving the single loop routing problem is presented. The purpose of the single loop routing problem(SLRP) is to find the shortest loop for an automated guided vehicle covering at least one edge of each department of a block layout. First it shown that this problem can be represented as a graph model. Then a meta-heuristic algorithm based on and colony system ...
متن کاملMulticast computer network routing using genetic algorithm and ant colony
Due to the growth and development of computer networks, the importance of the routing topic has been increased. The importance of the use of multicast networks is not negligible nowadays. Many of multimedia programs need to use a communication link to send a packet from a sender to several receivers. To support such programs, there is a need to make an optimal multicast tree to indicate the opt...
متن کاملAnt Colony Algorithm for the Single Loop Routing Problem
In this paper, a new algorithm for solving the single loop routing problem is presented. The purpose of the single loop routing problem(SLRP) is to find the shortest loop for an automated guided vehicle covering at least one edge of each department of a block layout. First it shown that this problem can be represented as a graph model. Then a meta-heuristic algorithm based on and colony system ...
متن کاملPBANT-Optimized ANT Colony Routing Algorithm For ManetsPBANT-Optimized ANT Colony Routing Algorithm For Manets
The biggest challenge in MANETs is to find a path between the communication end points, which is aggravated through the node mobility in a limited resource scenario.AntColony-Based Routing Algorithm (ARA) is an on-demand routing algorithm for mobile, multi-hop ad-hoc networks that uses swarm intelligence paradigm and ant colony based meta heuristic. These approaches try to map the solution capa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Energy Procedia
سال: 2011
ISSN: 1876-6102
DOI: 10.1016/j.egypro.2011.11.526